Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

高功率UWB天线阵及其在外场探测中的应用

运用切割式巴仑实现高功率超宽带天线的平衡馈电,并用FDTD进行仿真分析。研制出2×4元高功率天线阵,测量结果显示该天线阵能耐250kV以上高压,工作带宽达6个倍频(200～12 000MHz),具有较好的脉冲波形保真性。利用所研制的天线阵列建立外场探测实验系统,在外场进行目标探测试验。结果表明该天线阵可以用于实际的超宽带雷达发射天线阵,为高功率源在雷达探测中的应用作出了初步探索。     

相控阵天线关键技术发展趋势

相控阵天线必然朝着降低成本和提高性能的趋势发展,因此从以下几个方面分析其关键技术的发展方向:增加带宽,提高T/R组件的附加功率效率,移相器技术,数字化电路,以及引入稀布阵技术等。对相控阵技术的需求也是对这些相关技术发展的一种重要的推动力。     

雷达实际平面探测威力模型与仿真算法研究

在考虑地物遮蔽的情况下,建立了3种程式雷达实际平面探测威力的数学模型,并对参数获取、盲区估算等问题进行了讨论。给出了一种基于DEM数据的雷达实际平面探测威力实用算法,实现了雷达在任意高度层的实际平面探测威力的自动仿真生成。应用表明,雷达实际平面探测威力图绘制的精度和效率较传统方法有较大提高。     

区域防空导弹反导火力分配研究

分析了传统防空导弹火力分配模型的不足,考虑到编队内各舰艇近程防空作战能力的不同,结合装备性能特点,建立了基于机会约束规划的区域防空导弹火力分配优化模型。给出了基于遗传算法和BP神经网络的混合智能算法,该算法在精度和速度上均能满足防空作战的要求。     

Counterinsurgency Challenge in Post-2001 Afghanistan

Although the Taliban insurgency was internally divided and unable to coordinate its activities in 2014–2015, the Afghan security forces were not able to contain it and steadily lost ground throughout 2015. Until 2015, there had been little effort to develop an indigenous Afghan counterinsurgency strategy, but a sense of urgency emerged after a string of Taliban victories. At the beginning of 2016, it was still not clear if and when the National Unity Government would be able to produce a counterinsurgency strategy and, in any case, the need for a coherent counterinsurgency approach became questionable as the Taliban appeared to be transitioning towards conventional warfare.     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

应用于卫星导航功率倒置阵的改进LMS算法*

采用功率倒置准则的自适应天线阵特别适合于弱信号、强干扰的场合,因而在卫星导航系统中得到了广泛的应用。针对基于最小均方误差(LMS)算法实现的卫星导航功率倒置阵在干扰数目或干扰功率突然减少时,算法收敛慢、影响信号接收性能的问题,分析了这一现象的产生机理,并提出了相应的改进算法。改进算法通过功率监测来检测干扰数目或干扰功率的突变,然后对LMS算法进行复位处理重置权值来达到迅速收敛的目的。仿真结果表明,与原算法相比,改进算法可显著提高功率倒置阵的收敛速度。